package com.wc.alorithm_luogu.P1888;

import java.util.Arrays;
import java.util.Scanner;

/**
 * @Author congge
 * @Date 2023/4/19 13:05
 * @description https://www.luogu.com.cn/problem/P1888
 * 三角函数
 */
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] length = new int[3];
        int n = 3;
        while (n-- > 0) {
            length[n] = sc.nextInt();
        }

        Arrays.sort(length);

        // 求最大公约数，辗转相除法
        int a = length[0];
        int b = length[2];
        while (a != 0) {
            int tmp = b % a;
            b = a;
            a = tmp;
        }

        if (length[2] % length[0] == 0) {
            System.out.println(length[2] / length[0]);
        } else {
            System.out.println(length[0] / b + "/" + length[2] / b);
        }
    }
}
